Programming Research Group EFFICIENT DETERMINISTIC SORTING ON THE BSP MODEL
نویسندگان
چکیده
We present a new algorithm for deterministic sorting on the Bulk-Synchronous Parallel (BSP) model of computation. We sort n keys using a partitioning scheme that achieves the requirements of eeciency (one-optimality) and insensitivity against initial data distribution. Although we employ sampling to realize eeciency, we give a precise worst-case estimation of the maximum imbalance which might occur. The algorithm is one-optimal for a wide range of the BSP parameters in the sense that its speedup on p processors is asymptotically (1 ? o(1)) p.
منابع مشابه
Programming Research Group AN EXPERIMENTAL STUDY OF SORTING ALGORITHMS ON THE BSP MODEL: THEORY, PRACTICE AND EXPERIENCE
The Bulk-Synchronous Parallel (BSP) model of computation has been proposed by L.G. Valiant as a unifying and bridging model for the design, analysis and implementation of parallel algorithms that are both scalable and portable among diverse parallel machines. In this work we implement, using the Oxford BSP Toolset, BSPlib, a multiplicity of BSP deterministic and randomized sorting algorithms on...
متن کاملBSP Sorting: An experimental Study
The Bulk-Synchronous Parallel model of computation has been used for the architecture independent design and analysis of parallel algorithms whose performance is expressed not only in terms of problem size n but also in terms of parallel machine properties. In this paper the performance of implementations of deterministic and randomized BSP sorting algorithms is examined. The randomized algorit...
متن کاملProgramming Research Group COMMUNICATION EFFICIENT DATA STRUCTURES ON THE BSP MODEL WITH APPLICATIONS
The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the PRAM, ooers a serious challenge. In this work we undertake the architecture independent study of the communication and synchronization requirements of searching ordered h-level graphs, which include most of the standard data structures....
متن کاملThe design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کاملProgramming Research Group PRIMITIVE OPERATIONS ON THE BSP MODEL
The design of a complex algorithm relies heavily on a set of primitive operations and the instruments required to compile these operations into an algorithm. In this work, we examine some of these basic primitive operations and present algorithms that are suitable for the Bulk-Synchronous Parallel model. In particular, we consider algorithms for the following primitive operations: broadcasting,...
متن کامل